Bounds on relative generalised Hamming weight
نویسندگان
چکیده
منابع مشابه
Code constructions and existence bounds for relative generalized Hamming weight
The relative generalized Hamming weight (RGHW) of a linear code C and a subcode C1 is an extension of generalized Hamming weight. The concept was firstly used to protect messages from an adversary in the wiretap channel of type II with illegitimate parties. It was also applied to the wiretap network II for secrecy control of network coding and to trellis-based decoding algorithms for complexity...
متن کاملSome bounds for the relative generalized Hamming weights of some evaluation codes
In this paper we find some bounds for the relative generalized Hamming weights of some codes parameterized by a set of monomials of the same degree. Also we compare the relative generalized Hamming weights of the codes CX(d) and CX′(d) when X ′ is embedded in X. We use these results to obtain some lower bounds for the relative generalized Hamming weights of the codes parameterized by the edges ...
متن کاملWeight Distributions of Hamming Codes
We derive a recursive formula determining the weight distribution of the [n = (qm − 1)/(q − 1), n − m, 3] Hamming code H(m, q), when (m, q−1) = 1. Here q is a prime power. The proof is based on Moisio’s idea of using Pless power moment identity together with exponential sum techniques.
متن کاملSome Bounds on Communication Complexity of Gap Hamming Distance
In this paper we obtain some bounds on communication complexity of Gap Hamming Distance problem (GHDnL,U ): Alice and Bob are given binary string of length n and they are guaranteed that Hamming distance between their inputs is either ≤ L or ≥ U for some L < U . They have to output 0, if the first inequality holds, and 1, if the second inequality holds. In this paper we study the communication ...
متن کاملInteger Addition and Hamming Weight
We study the effect of addition on the Hamming weight of a positive integer. Consider the first 2n positive integers, and fix an α among them. We show that if the binary representation of α consists of Θ(n) blocks of zeros and ones, then addition by α causes a constant fraction of low Hamming weight integers to become high Hamming weight integers. This result has applications in complexity theo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Communications
سال: 2020
ISSN: 1751-8636,1751-8636
DOI: 10.1049/iet-com.2019.0903